binary search trees meaning in English
第十二章 二叉查找树
Examples
- On the subtrees of random binary search trees
随机二叉搜索树的子树 - A binary search tree is a binary tree with the following properties
二进制搜索树( bst )是具有以下属性的二进制树： - Binary search tree
二叉查找树 - Binary search trees are useful for finding items in a list that changes infrequently
二叉搜索树在查找经常变化的列表时是很非常有用的。 - Add and remove operations are typically expensive since binary search trees require that a tree be balanced
通常需要增加和删除操作，因为二叉树需要被平衡。